Approaching the Minimum Distance Problem by Algebraic Swarm-Based Optimizations

Finding the minimum distance of linear codes is one main problems in coding theory. The importance comes from its error-correcting and error-detecting capability handled codes. It was proven that this problem an NP-hard solution can be guessed verified polynomial time but no particular rule followed to make guess some meta-heuristic approaches literature have been used solve problem. In paper, swarm-based optimization techniques, bat firefly, are applied by integrating algebraic operator algorithms.